Dynamic Multi-Compartment Vehicle Routing Problem for Smart Waste Collection
نویسندگان
چکیده
The rapid increase in urbanization results an the volume of municipal solid waste produced every day, causing overflow garbage cans and thus distorting city’s appearance; for this environmental reasons, smart cities involve use modern technologies intelligent efficient management. Smart bins urban environments contain sensors that measure status containers real-time trigger wireless alarms if container reaches a predetermined threshold, then communicate information to operations center, which sends vehicles collect from selected stations order significant amount reduce transportation costs. In article, we will address issue Dynamic Multi-Compartmental Vehicle Routing Problem (DM-CVRP) selective collection. This problem is summarized as linear mathematical programming model define optimal dynamic routes minimize total cost, are costs penalty caused by exceeding bin capacity. hybridized genetic algorithm (GA) proposed solve problem, effectiveness approach verified extensive numerical experiments on instances given Valorsul, with some modifications adapt these data our problem. Then were able ensure based static cases, very encouraging.
منابع مشابه
Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan
Collection of waste is an important logistic activity within any city. In this study, a mathematical model is proposed in order to reduce the cost of waste collection. First a mixed-integer nonlinear programming model is provided including a waste collection routing problem, so that, there is a balance between the distance between trashcans, and the similarity of the trashcans in terms of th...
متن کاملVehicle Routing for a Complex Waste Collection Problem
We consider a complex waste collection problem, where the residents of a certain region dispose of recyclable waste, which is collected using a fixed heterogeneous fleet of vehicles with different volume and weight capacities, fixed costs, unit distance running costs and hourly driver wage rates. Each tour starts and ends at one of several depots, not necessarily the same, and is a sequence of ...
متن کاملDistributed Swarm Optimization Modeling for Waste Collection Vehicle Routing Problem
In this paper, we consider a complex garbage collection problem, where the residents of a particular area dispose of recyclable garbage, which is collected and managed using a fleet of trucks with different weight capacities and volume. This tour is characterized by a set of constraints such as the maximum tour duration (in term of distance and the timing) consumed to collect wastes from severa...
متن کاملThe multi-compartment vehicle routing problem with flexible compartment sizes
In this paper, a capacitated vehicle routing problem is discussed which occurs in the context of glass waste collection. Supplies of several different product types (glass of different colors) are available at customer locations. The supplies have to be picked up at their locations and moved to a central depot at minimum cost. Different product types may be transported on the same vehicle, howe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied system innovation
سال: 2023
ISSN: ['2571-5577']
DOI: https://doi.org/10.3390/asi6010030